Packing Rectangular Pieces--A Heuristic Approach
نویسندگان
چکیده
منابع مشابه
Experimenting Genetic Approach to Extend Rectangular Packing Heuristic Solution
Nesting (Cutting and Packing) problems are optimization problem encountered in many areas of business that look for good arrangement of multiple items in larger containing regions. The objective of this problem is to maximize the utilization of resource material. There is a large range of the applicability of these problems as there are many diverse instances of it that are encountered in the i...
متن کاملA Hybrid Heuristic Algorithm for the Rectangular Packing Problem
A hybrid heuristic algorithm for the two-dimensional rectangular packing problem is presented. This algorithm is mainly based on divide-andconquer and greedy strategies. The computational results on a class of benchmark problems have shown that the performance of the heuristic algorithm can outperform that of quasi-human heuristics.
متن کاملA Meta-heuristic Algorithm for the Strip Rectangular Packing Problem
A new meta-heuristic algorithm to find the minimum height for twodimensional strip rectangular packing problem is presented. This algorithm is mainly based on the heuristic recursive strategy and simulated annealing algorithm. The computational results on a class of benchmark problems have shown that this algorithm not only finds shorter height than known meta-heuristic but also runs in shorter...
متن کاملA Parallel Hyper-heuristic Approach for the Two-dimensional Rectangular Strip-packing Problem
In this paper, we present a parallel hyper-heuristic approach for two-dimensional rectangular strip-packing problems (2DSP). This is an island model with a special master-slave structure, and in all the islands we run a memetic algorithm-based hyper-heuristic (HH). The basic technique of this HH is a memory-based evolutionary technique, the “extended virtual loser” (EVL). The memory-based techn...
متن کاملBidirectional best-fit heuristic for orthogonal rectangular strip packing
In a non-guillotinable rectangular strip packing problem (RF-SPP), the best orthogonal placement of given rectangular pieces on a strip of stock sheet having fixed width and infinite height are searched. The aim is to minimize the height of the strip while including all the pieces in appropriate orientations. In this study, a novel bidirectional best-fit heuristic (BBF) is introduced for solvin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1982
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/25.3.353